package Day24;

import java.util.HashMap;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {

        Scanner in = new Scanner(System.in);
        int m = in.nextInt();
        int n = in.nextInt();
        int[][] maze = new int[m][n];

        for (int i = 0; i < m; i++) {
            for (int j = 0; j < n; j++) {
                maze[i][j] = in.nextInt();
            }
        }

        int[][] solution = new int[m][n];
        String[][] origin = new String[m][n];

        for (int i = 0; i < m; i++) {
            for (int j = 0; j < n; j++) {
                if (m == 0) {
                    if (n == 0) {

                    }
                }
            }
        }

        for (int i = 0; i < m; i++) {
            for (int j = 0; j < n; j++) {
                if (solution[i][j] == 1) {
                    System.out.println("(" + m + n + ")");
                }
            }
        }

    }

    public static int getMost(int[][] board) {

        int m = board.length;
        int n = board[0].length;
        int[][] dp = new int[m][n];

         dp[0][0] = board[0][0];
        for (int i = 1; i < m; i++) {
            dp[i][0] = board[i][0] + dp[i - 1][0];
        }
        for (int i = 1; i < n; i++) {
            dp[0][i] = board[0][i] + dp[0][i - 1];
        }

        for (int i = 1; i < m; i++) {
            for (int j = 1; j < n; j++) {
                if (dp[i - 1][j] > dp[i][j - 1]) {
                    dp[i][j] = board[i][j] + dp[i - 1][j];
                } else {
                    dp[i][j] = board[i][j] + dp[i][j - 1];
                }
            }
        }

        return dp[m - 1][n - 1];
    }

}
